Toeplitz and Toeplitz-block-Toeplitz matrices and their correlation with syzygies of polynomials
نویسندگان
چکیده
In this paper, we re-investigate the resolution of Toeplitz systems T u = g, from a new point of view, by correlating the solution of such problems with syzygies of polynomials or moving lines. We show an explicit connection between the generators of a Toeplitz matrix and the generators of the corresponding module of syzygies. We show that this module is generated by two elements of degree n and the solution of T u = g can be reinterpreted as the remainder of an explicit vector depending on g, by these two generators. This approach extends naturally to multivariate problems and we describe for Toeplitz-block-Toeplitz matrices, the structure of the corresponding generators.
منابع مشابه
An application of Fibonacci numbers into infinite Toeplitz matrices
The main purpose of this paper is to define a new regular matrix by using Fibonacci numbers and to investigate its matrix domain in the classical sequence spaces $ell _{p},ell _{infty },c$ and $c_{0}$, where $1leq p
متن کاملSuperfast solution of Toeplitz systems based on syzygy reduction
We present a new superfast algorithm for solving Toeplitz systems. This algorithm is based on a relation between the solution of such problems and syzygies of polynomials or moving lines. We show an explicit connection between the generators of a Toeplitz matrix and the generators of the corresponding module of syzygies. We show that this module is generated by two elements and the solution of ...
متن کاملMean value theorem for integrals and its application on numerically solving of Fredholm integral equation of second kind with Toeplitz plus Hankel Kernel
The subject of this paper is the solution of the Fredholm integral equation with Toeplitz, Hankel and the Toeplitz plus Hankel kernel. The mean value theorem for integrals is applied and then extended for solving high dimensional problems and finally, some example and graph of error function are presented to show the ability and simplicity of the method.
متن کاملHigh Performance Algorithms for Toeplitz and block Toeplitz matrices
High Performance Algorithms for Toeplitz and block Toeplitz matrices
متن کاملKronecker product approximations for dense block Toeplitz-plus-Hankel matrices
In this paper, we consider the approximation of dense block Toeplitz-plus-Hankel matrices by sums of Kronecker products. We present an algorithm for efficiently computing the matrix approximation that requires the factorization of matrices of much smaller dimension than that of the original. The main results are described for block Toeplitz matrices with Toeplitz-plus-Hankel blocks (BTTHB), but...
متن کامل